|
課程名稱 |
機率方法
|
|
開課學期 |
95-1 |
|
授課對象 |
理學院 數學研究所 |
|
授課教師 |
葉鴻國 |
|
課號 |
MATH |
|
課程識別碼 |
221 U5100 |
|
班次 |
|
|
學分 |
3 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期三2,3,4(9:10~12:10) |
|
上課地點 |
新401 |
|
備註 |
先修機率論,圖論 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
本課程尚未建立核心能力關連 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
The purpose of this course is to introduce probabilistic methods in Combinatorics and their applications in theoretical Computer Science. I will be trying to use material both from combinatorics and algorithms, but the emphasis will be on combinatorics. The topics include linearity of expectation, the second moment method, the local lemma, correlation inequalities, martingales, large deviation inequalities, geometry, derandomization (changes are possible). |
|
課程目標 |
最新訊息請參考：http://www.math.ntu.edu.tw/home_c.htm 點選【課程】 |
|
課程要求 |
建議先修:
機率論，圖論 |
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
|
|
參考書目 |
課程內容主要教科書: The Probabilistic Method, 2nd Ed, by Noga Alon and Joel Spencer, 2000.
課程內容次要教科書: [1] Graph Colouring and the Probabilistic Method, by Molloy M and Reed B.,Springer-Verlag, 2001. [2] Randomized Algorithms, by Motwani and Raghavan, 1995.
|
|
評量方式
(僅供參考) |
|
|